The Sherman-Morrison-Woodbury formula for the generalized inverses
نویسندگان
چکیده
In this paper, we investigate the Sherman-Morrison-Woodbury formula for {1}-inverses and {2}-inverses of bounded linear operators on a Hilbert space. Some conditions are established to guarantee that (A+YGZ*)? = A? ?A?Y(G? +Z*A?Y)?Z*A? holds, where stands any kind standard inverse, {1}-inverse, {2}-inverse, Moore-Penrose Drazin group core inverse dual A.
منابع مشابه
A generalization of the Sherman-Morrison-Woodbury formula
In this paper, we develop conditions under which the Sherman–Morrison–Woodbury formula can be represented in the Moore–Penrose inverse and the generalized Drazin inverse forms. These results generalize the original Sherman–Morrison–Woodbury formula. © 2011 Elsevier Ltd. All rights reserved.
متن کاملRemarks on the Sherman-morrison-woodbury Formulae
We present some results on generalized inverses and their application to generalizations of the Sherman-Morrison-Woodbury-type formulae.
متن کاملSherman-Morrison-Woodbury Formula-based Algorithms for the Surface Smoothing Problem
Surface smoothing applied to range/elevation data acquired using a variety of sources has been a very active area of research in computational vision over the past decade. Generalized splines have emerged as the single most popular approximation tool to this end. In this paper we present a new and fast algorithm for solving the surface smoothing problem using a membrane, a thin-plate, or a thin...
متن کاملA New Algorithm for General Cyclic Heptadiagonal Linear Systems Using Sherman-Morrison-Woodbury formula
In this paper, a new efficient computational algorithm is presented for solving cyclic heptadiagonal linear systems based on using of heptadiagonal linear solver and Sherman–Morrison–Woodbury formula. The implementation of the algorithm using computer algebra systems (CAS) such as MAPLE and MATLAB is straightforward. Numerical example is presented for the sake of illustration.
متن کاملPreconditioning Sparse Nonsymmetric Linear Systems with the Sherman-Morrison Formula
Let Ax = b be a large, sparse, nonsymmetric system of linear equations. A new sparse approximate inverse preconditioning technique for such a class of systems is proposed. We show how the matrix A−1 0 −A−1, where A0 is a nonsingular matrix whose inverse is known or easy to compute, can be factorized in the form UΩV T using the Sherman–Morrison formula. When this factorization process is done in...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Filomat
سال: 2022
ISSN: ['2406-0933', '0354-5180']
DOI: https://doi.org/10.2298/fil2215307l